Integrity Constraints as Views in DeductiveDatabases
نویسندگان
چکیده
In this paper we present a refutation procedure to compute goals in a deductive database according to particular views of it. Views are deened by a set of constraints rules. The declarative semantics of the constrained database is deened and the given refutation procedure is proved correct and complete for positive range{restricted databases. The extension of the procedure to deal with negation is also outlined.
منابع مشابه
An Amateur's Introduction to Integrity Constraints and Integrity Checking in SQL
In this paper we survey the various forms of integrity constraints provided in SQL. A critical discussion of the implications of SQL's approach to integrity follows, particularly identifying misconceptions to be found in some textbooks. The relationship between views and constraints in SQL is investigated and contrasted with the state-ofthe-art in integrity checking for deductive databases. As ...
متن کاملReformulation with Integrity Constraints ( extended abstract ) Rada
In this paper we study the problem of reducing the evaluation costs of queries on finite databases in presence of integrity constraints, by designing and materializing views. Given a database schema, a set of queries defined on the schema, a set of integrity constraints, and a storage limit, to find a solution to this problem means to find a set of views that satisfies the storage limit, provid...
متن کاملReformulation with Integrity Constraints ( extended abstract )
In this paper we study the problem of reducing the evaluation costs of queries on finite databases in presence of integrity constraints, by designing and materializing views. Given a database schema, a set of queries defined on the schema, a set of integrity constraints, and a storage limit, to find a solution to this problem means to find a set of views that satisfies the storage limit, provid...
متن کاملDatabase Reformulation with Integrity Constraints (extended abstract)
In this paper we study the problem of reducing the evaluation costs of queries on finite databases in presence of integrity constraints, by designing and materializing views. Given a database schema, a set of queries defined on the schema, a set of integrity constraints, and a storage limit, to find a solution to this problem means to find a set of views that satisfies the storage limit, provid...
متن کاملIntegrity Constraints as Views in Deductice Databases
In this paper we present a refutation procedure to compute goals in a deductive database according to particular views of it. Views are deened by a set of constraints rules. The declarative semantics of the constrained database is deened and the given refutation procedure is proved correct and complete for positive range{restricted databases. The extension of the procedure to deal with negation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996